Pfair Scheduling of Generalized Pinwheel Task Systems

The scheduling of generalized pinwheel task systems is considered. It is shown that pinwheel scheduling is closely related to the fair scheduling of periodic task systems. This relationship is exploited to obtain new scheduling algorithms for generalized pinwheel task systems. When compared to traditional pinwheel scheduling algorithms, these new algorithms are both more efficient from a runtime complexity point of view, and have a higher density threshold, on a very large subclass of generalized pinwheel task systems.